Merging for time inhomogeneous finite Markov chains, Part I: Singular values and stability
نویسندگان
چکیده
منابع مشابه
Merging for time inhomogeneous finite Markov chains, Part I: singular values and stability
We develop singular value techniques in the context of time inhomogeneous finite Markov chains with the goal of obtaining quantitative results concerning the asymptotic behavior of such chains. We introduce the notion of c-stability which can be viewed as a generalization of the case when a time inhomogeneous chain admits an invariant measure. We describe a number of examples where these techni...
متن کاملMerging and stability for time inhomogeneous finite Markov chains
As is apparent from most text books, the definition of a Markov process includes, in the most natural way, processes that are time inhomogeneous. Nevertheless, most modern references quickly restrict themselves to the time homogeneous case by assuming the existence of a time homogeneous transition function, a case for which there is a vast literature. The goal of this paper is to point out some...
متن کاملMerging for inhomogeneous finite Markov chains, part II: Nash and log-Sobolev inequalities
We study time-inhomogeneous Markov chains with finite state spaces using Nash and Logarithmic-Sobolev inequalities, and the notion of cstability. We develop the basic theory of such functional inequalities in the time-inhomogeneous context and provide illustrating examples.
متن کاملMerge Times and Hitting Times of Time-inhomogeneous Markov Chains
The purpose of this thesis is to study the long term behavior of time-inhomogeneous Markov chains. We analyze under what conditions they converge, in what sense they converge and what the rate of convergence should be. A Markov chain is a random process with the memoryless property: the next state only depends on the current state, and not on the sequence of events that preceded it. Time-inhomo...
متن کاملCompositional Modeling and Minimization of Time-Inhomogeneous Markov Chains
This paper presents a compositional framework for the modeling of interactive continuous-time Markov chains with time-dependent rates, a subclass of communicating piecewise deterministic Markov processes. A poly-time algorithm is presented for computing the coarsest quotient under strong bisimulation for rate functions that are either piecewise uniform or (piecewise) polynomial. Strong as well ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Journal of Probability
سال: 2009
ISSN: 1083-6489
DOI: 10.1214/ejp.v14-656